Comprehensive Gröbner Bases in a Java Computer Algebra System
نویسنده
چکیده
We present an implementation of the algorithms for computing comprehensive Gröbner bases in a Java computer algebra system (JAS). Contrary to approaches to implement comprehensive Gröbner bases with minimal requirements to the computer algebra system, we aim to provide and utilize all necessary algebraic structures occurring in the algorithm. In the implementation of a condition we aim at the maximal semantic exploitation of the occurring algebraic structures: the set of equations equal zero are implemented as an ideal (with Gröbner base computation) and the set of inequalities are implemented as a multiplicative set which is simplified to polynomials of minimal degrees using, for example, square-free decomposition. With our approach we can also make the transition of a comprehensive Gröbner system to a polynomial ring over a (commutative, finite, von Neuman) regular coefficient ring and test or compute Gröbner bases in such polynomial rings.
منابع مشابه
Computational Tutorial on Gröbner bases embedding Sage in LaTeX with SageTEX
A comprehensive treatment of the theory of Gröbner bases is far beyond the scope of this tutorial. The reader is reffered to [1], [2], [3] for a more detailed discussion. Gröbner bases offers a powerful algorithmic criterion for the existence of solutions to a system of algebraic equations over algebraically closed fields. While the theory is rich and builds on the theory of Ideals and Varietie...
متن کاملTime Optimal Control Using Gröbner Bases
Abstract: The paper presents the solution of the time optimal control with the help of Gröbner Bases theory. First the set of polynomial equations for the triple integrator system with unknowns corresponding to the switching times is constructed and later it is solved in the computer algebra system Maple using the Groebner library. In dependence of resulting switching times the control action i...
متن کاملSolving System of Linear Congruence Equations over some Rings by Decompositions of Modules
In this paper, we deal with solving systems of linear congruences over commutative CF-rings. More precisely, let R be a CF-ring (every finitely generated direct sum of cyclic R-modules has a canonical form) and let I_1,..., I_n be n ideals of R. We introduce congruence matrices theory techniques and exploit its application to solve the above system. Further, we investigate the application of co...
متن کاملComputing one of Victor Moll's irresistible integrals with computer algebra
We investigate a certain quartic integral from V. Moll’s book “Irresistible Integrals” and demonstrate how it can be solved by computer algebra methods, namely by using non-commutative Gröbner bases. We present recent implementations in the computer algebra systems Singular and Mathematica.
متن کاملExtending Clause Learning of SAT Solvers with Boolean Gröbner Bases
We extend clause learning as performed by most modern SAT Solvers by integrating the computation of Boolean Gröbner bases into the conflict learning process. Instead of learning only one clause per conflict, we compute and learn additional binary clauses from a Gröbner basis of the current conflict. We used the Gröbner basis engine of the logic package Redlog contained in the computer algebra s...
متن کامل